ar X iv : c s / 06 12 08 3 v 3 [ cs . D C ] 1 A ug 2 00 7 A Byzantine Fault Tolerant Distributed Commit Protocol ∗
نویسنده
چکیده
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a Byzantine agreement algorithm among the coordinator replicas. Our protocol can tolerate Byzantine faults at the coordinator replicas and a subset of malicious faults at the participants. A decision certificate, which includes a set of registration records and a set of votes from participants, is used to facilitate the coordinator replicas to reach a Byzantine agreement on the outcome of each transaction. The certificate also limits the ways a faulty replica can use towards non-atomic termination of transactions, or semantically incorrect transaction outcomes.
منابع مشابه
ar X iv : c s / 06 08 12 0 v 1 [ cs . G T ] 3 0 A ug 2 00 6 Controller synthesis & Ordinal Automata
Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak in 2005. It involves partial observability and a new synchronization between the controller and the environment.
متن کاملar X iv : c s / 06 08 12 3 v 1 [ cs . I T ] 3 1 A ug 2 00 6 Proof of a Conjecture of Helleseth Regarding Pairs of Binary m - Sequences ∗
–Binary m-sequences are maximal length sequences generated by shift registers of length m, that are employed in navigation, radar, and spread-spectrum communication. It is well known that given a pair of distinct m-sequences, the crosscorrelation function must take on at least three values. This correspondence shows the three correlation values are symmetric about -1. The main result is a proof...
متن کاملar X iv : c s / 06 08 12 0 v 2 [ cs . G T ] 3 0 O ct 2 00 6 Controller synthesis & Ordinal Automata
Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak in 2005. It involves partial observability and a new synchronization between the controller and the environment.
متن کاملar X iv : m at h / 06 08 16 3 v 1 [ m at h . L O ] 7 A ug 2 00 6 IND - AND PRO - DEFINABLE SETS
We describe the indand procategories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.
متن کامل